Eulerian disjoint paths problem in grid graphs is NP-complete
نویسندگان
چکیده
منابع مشابه
Eulerian disjoint paths problem in grid graphs is NP-complete
We show that the edge disjoint paths problem is NP-complete in directed or undirected rectangular grids, even if the union G + H of the supply and the demand graph is Eulerian.
متن کاملThe edge-disjoint paths problem is NP-complete for series-parallel graphs
Many combinatorial problems are NP-complete for general graphs. However, when restricted to series–parallel graphs or partial k-trees, many of these problems can be solved in polynomial time, mostly in linear time. On the other hand, very few problems are known to be NP-complete for series–parallel graphs or partial k-trees. These include the subgraph isomorphism problem and the bandwidth probl...
متن کاملThe Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees. On the other hand, very few problems are known to be NP-complete for partial k-trees with bounded k. These include the subgraph isomorphism problem ...
متن کاملGreedy Edge-Disjoint Paths in Complete Graphs
The maximum edge-disjoint paths problem (MEDP) is one of the most classical NP-hard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortest-pathfirst greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is at most 54. Adapting results by Kolman and Scheideler [Proceedings of SODA, 2002, pp. 184–193], we ...
متن کاملAn NP-Complete Problem in Grid Coloring
A c-coloring of Gn,m = [n] × [m] is a mapping of Gn,m into [c] such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the internet to find a 4-coloring of G17,17. This attracted considerable attention from the popular mathematics community. A coloring was produced; however, finding it proved to be difficult. The question arises: is the problem of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.12.003